Utility-Theoretic Ranking for Semiautomated Text Classification
نویسندگان
چکیده
منابع مشابه
Accuracy Based Feature Ranking Metric for Multi-Label Text Classification
In many application domains, such as machine learning, scene and video classification, data mining, medical diagnosis and machine vision, instances belong to more than one categories. Feature selection in single label text classification is used to reduce the dimensionality of datasets by filtering out irrelevant and redundant features. The process of dimensionality reduction in multi-label cla...
متن کاملA Divisive Information-Theoretic Feature Clustering Algorithm for Text Classification
High dimensionality of text can be a deterrent in applying complex learners such as Support Vector Machines to the task of text classification. Feature clustering is a powerful alternative to feature selection for reducing the dimensionality of text data. In this paper we propose a new informationtheoretic divisive algorithm for feature/word clustering and apply it to text classification. Exist...
متن کاملAMBRA: A Ranking Approach to Temporal Text Classification
This paper describes the AMBRA system, entered in the SemEval-2015 Task 7: ‘Diachronic Text Evaluation’ subtasks one and two, which consist of predicting the date when a text was originally written. The task is valuable for applications in digital humanities, information systems, and historical linguistics. The novelty of this shared task consists of incorporating label uncertainty by assigning...
متن کاملInformation Theoretic Text Classification Using the Ziv-Merhav Method
Most approaches to text classification rely on some measure of (dis)similarity between sequences of symbols. Information theoretic measures have the advantage of making very few assumptions on the models which are considered to have generated the sequences, and have been the focus of recent interest. This paper addresses the use of the Ziv-Merhav method (ZMM) for the estimation of relative entr...
متن کاملA graph-theoretic approach for reducing one-versus-one multi-class classification to ranking
Can a multi-class classification model in some situations be simplified to a ranking model without sacrificing performance? We try to answer that question from a theoretical point of view for one-versus-one multi-class ensembles. To this end, sufficient conditions are derived for which a one-versus-one ensemble becomes ranking representable, i.e. conditions for which the ensemble can be reduced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2015
ISSN: 1556-4681,1556-472X
DOI: 10.1145/2742548